By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 11, Issue 2, pp. 201-408

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Continuous Data Types

M. R. Levy and T. S. E. Maibaum

pp. 201-216

BibTeX  Abstract Full Text:  PDF

Geometric Problems with Application to Hashing

Douglas Comer and Michael J. O'Donnell

pp. 217-226

BibTeX  Abstract Full Text:  PDF

Graphs That are Almost Binary Trees

Jia-Wei Hong and Arnold L. Rosenberg

pp. 227-242

BibTeX  Abstract Full Text:  PDF

An Asymptotically Optimal Algorithm for the Dutch National Flag Problem

James R. Bitner

pp. 243-262

BibTeX  Abstract Full Text:  PDF

Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication

Francesco Romani

pp. 263-267

BibTeX  Abstract Full Text:  PDF

On Transforming Control Structures

John Keohane, John C. Cherniavsky, and Peter B. Henderson

pp. 268-286

BibTeX  Abstract Full Text:  PDF

A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation

A. Borodin and S. Cook

pp. 287-297

BibTeX  Abstract Full Text:  PDF

The Recognition of Series Parallel Digraphs

Jacobo Valdes, Robert E. Tarjan, and Eugene L. Lawler

pp. 298-313

BibTeX  Abstract Full Text:  PDF

Parallel Algorithms in Graph Theory: Planarity Testing

Joseph Ja'Ja' and Janos Simon

pp. 314-328

BibTeX  Abstract Full Text:  PDF

Planar Formulae and Their Uses

David Lichtenstein

pp. 329-343

BibTeX  Abstract Full Text:  PDF

On the Accepting Density Hierarchy in NP

Shlomo Moran

pp. 344-349

BibTeX  Abstract Full Text:  PDF

A Scheme for Fast Parallel Communication

L. G. Valiant

pp. 350-361

BibTeX  Abstract Full Text:  PDF

Computation of Matrix Chain Products. Part I

T. C. Hu and M. T. Shing

pp. 362-373

BibTeX  Abstract Full Text:  PDF

On Primality Tests

Daniel J. Lehmann

pp. 374-375

BibTeX  Abstract Full Text:  PDF

The Complexity of Finding Cycles in Periodic Functions

Robert Sedgewick, Thomas G. Szymanski, and Andrew C. Yao

pp. 376-390

BibTeX  Abstract Full Text:  PDF

Freedom from Deadlock of Safe Locking Policies

Mihalis Yannakakis

pp. 391-408

BibTeX  Abstract Full Text:  PDF